Automated amortised resource analysis for term rewrite systems

Multivariate Amortised Resource Analysis for Term Rewrite Systems

We study amortised resource analysis in the context of term rewrite systems. We introduce a novel amortised analysis based on the potential method. The method is represented in an inference system akin to a type system and gives rise to polynomial bounds on the innermost runtime complexity of the analysed rewrite system. The crucial feature of the inference system is the admittance of multivari...

Automated Complexity Analysis of Term Rewrite Systems

Automated amortised analysis

Interpretation. The basic idea of abstract interpretation is to simplify and omit all calculations that do not directly influence the execution costs. For example, instead of computing a numeric value, it is only computed whether it is positive or negative, thereby speeding up the execution of the program to be examined. While having the attraction of being very general, one major disadvantage

Amortised resource analysis for object-oriented programs

As software systems rise in size and complexity, the need for verifying some of their properties increases. One important property to be verified is the resource usage, i.e. how many resources the program will need for its execution, where resources include execution time, memory, power, etc. Resource usage analysis is important in many areas, in particular embedded systems and cloud computing....

Amortised Resource Analysis with Separation Logic

Type-based amortised resource analysis following Hofmann and Jost—where resources are associated with individual elements of data structures and doled out to the programmer under a linear typing discipline—have been successful in providing concrete resource bounds for functional programs, with good support for inference. In this work we translate the idea of amortised resource analysis to imper...